Semantic Maps or Coding Maps? Towards a Unified Account of the Coding Degree, Coding Complexity, and Coding Distance of Coordination Relations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantic Maps or Coding Maps? Towards a Unified Account of the Coding Degree, Coding Complexity, and Coding Distance of Coordination Relations

The aim of this paper is to explore the degree to which semantic maps and conceptual spaces may comprehensively describe the cross-linguistic variation, by discussing the types of phenomena that may be consistently represented in a unified account. By analyzing the cross-linguistic coding of coordination relations, it will be argued that the degree to which every conceptual situation is explici...

متن کامل

Transient expression of coding and non-coding regions of PVY confer resistance to virus infection

One of the most efficient mechanisms by which plants protect themselves from invading virusesis the specific RNA-dependent silencing pathway termed post-transcriptional gene silencing(PTGS). In this mechanism, resistance to a virus is engineered through the expression of asegment of the virus genomein transgenic plants. Potato VirusY (PVY) is one of the mostdamaging viruses of potato, infecting...

متن کامل

Gray coding planar maps

The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize β-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps.

متن کامل

Gray coding cubic planar maps

The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize β-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps.

متن کامل

Coding with variable block maps

In this article we study a special class of sliding block maps that we call variable block maps.We characterize the subsets of finite and infinite sequences that can be obtained as the image of another subset of symbolic sequences by a variable block map. On the other way, we show that the coding process induced by such kind of block maps can be reversed, even with partial knowledge about the v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linguistic Discovery

سال: 2010

ISSN: 1537-0852

DOI: 10.1349/ps1.1537-0852.a.351